A recursive branch-and-bound algorithm for constrained homogenous T-shape cutting patterns
نویسندگان
چکیده
منابع مشابه
An Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملAn Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملPattern Generation for Two- Dimensional Cutting Stock Problem with Location
Selection of feasible cutting patterns in order to minimize the raw material wastage which is known as cutting stock problem has become a key factor of the success in today’s competitive manufacturing industries. In this paper, solving a rectangular shape medium size two-dimensional cutting stock problem is discussed. Our study is restricted to raw materials (main sheets) in a rectangular shape...
متن کاملA New Parallel Approach to the Constrained Two-Dimensional Cutting Stock Problem
In this paper we present a new parallelization of an efficient best-first branch-and-bound algorithm to solve the constrained two-dimensional single stock guillotine cutting stock problem (CSP) to optimality. The underlying sequential branch-and-bound algorithm is based on an exact version of Wang's heuristic suggested by Viswanathan and Bagchi. In our algorithm we improve the upper bound and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical and Computer Modelling
دوره 54 شماره
صفحات -
تاریخ انتشار 2011